Prime points on elliptic curves and it possible impact on ECDLP
نویسنده
چکیده
In this paper we present that some statistical properties of points on elliptic curve can be used to form new equivalence classes. This can have an impact on solving discrete logarithm (ECDLP) owing to the reduction of the number of points among which a logarithm is searched to points of particular features. It should lead to an improvement of the Pollard-rho algorithm.
منابع مشابه
On Remarks of Lifting Problems for Elliptic Curves
The Elliptic Curve Discrete Logarithm Problem(ECDLP) is known to be an exponential time problem except the cases of smooth curves, supersingular curves and anomalous curves. Recently, several new methods to solve ECDLP on a prime eld were proposed. All of them try to solve ECDLP on a prime eld by lifting a given elliptic curve to low rank elliptic curves de ned over the rationals. In this exten...
متن کاملThe Discrete Logarithm Problem on the p-torsion Subgroup of Elliptic Curves
An ongoing challenge in cryptography is to find groups in which the DLP is computationally infeasible, that is, for which the best known attack is exponential in log(N). Such a group can be used as the setting for many cryptographic protocols, from Diffie-Hellman key exchange to El Gamal encryption ([14], 159). The most prominent example, first proposed in 1985, is a subgroup of points of an el...
متن کاملUsing Symmetries and Fast Change of Ordering in the Index Calculus for Elliptic Curves Discrete Logarithm
This abstract presents results on polynomial systems involved in an algebraic attack on elliptic curves cryptosystems. The security of these cryptosystems is based on the difficulty to solve the elliptic curves discrete logarithm problem (ECDLP): let E be an elliptic curve defined over a finite field K. The set of its rational points forms a commutative group, E(K). Given two points P and Q of ...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملDiscrete Logarithms and Mordell-Weil Groups
Let Ep be an elliptic curve over a prime finite field Fp, p ≥ 5, and Pp, Qp ∈ Ep(Fp). The elliptic curve discrete logarithm problem, ECDLP, on Ep is to find mp ∈ Fp such that Qp = mpPp if Qp ∈ 〈Pp〉. We propose an algorithm to attack the ECDLP relying on a Hasse principle detecting linear dependence in Mordell-Weil groups of elliptic curves via a finite number of reductions.
متن کامل